Cone order association and stochastic cone ordering with applications to order-restricted testing

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Applications of Second Order Cone Programming

A significant special case of the problems which could be solved were those whose constraints were given by semidefinite cones. A Semidefinite Program (SDP) is an optimisation over the intersection of an affine set and cone of positive semidefinite matrices (Alizadeh and Goldfarb, 2001). Cone programming is discussed more in Section 3. Within semidefinite programming there is a smaller set of p...

متن کامل

Solving A Fractional Program with Second Order Cone Constraint

We consider a fractional program with both linear and quadratic equation in numerator and denominator  having second order cone (SOC) constraints. With a suitable change of variable, we transform the problem into a  second order cone programming (SOCP)  problem.  For the quadratic fractional case, using a relaxation, the problem is reduced to a semi-definite optimization (SDO) program. The p...

متن کامل

Applications of Second-order Cone Programming

In a second-order cone program (SOCP) a linear function is minimized over the intersection of an a ne set and the product of second-order (quadratic) cones. SOCPs are nonlinear convex problems that include linear and (convex) quadratic programs as special cases, but are less general than semide nite programs (SDPs). Several e cient primal-dual interior-point methods for SOCP have been developed...

متن کامل

Second-order cone programming

Second-order cone programming (SOCP) problems are convex optimization problems in which a linear function is minimized over the intersection of an affine linear manifold with the Cartesian product of second-order (Lorentz) cones. Linear programs, convex quadratic programs and quadratically constrained convex quadratic programs can all be formulated as SOCP problems, as can many other problems t...

متن کامل

Stochastic Second-Order Cone Programming in Mobile Ad Hoc Networks

We propose a two-stage stochastic second-order cone programming formulation of the semidefinite stochastic location-aided routing (SLAR) model, described in Ariyawansa and Zhu (Q. J. Oper. Res. 4(3), 239–253, 2006). The aim is to provide a sender node S with an algorithm for optimally determining a region that is expected to contain a destination node D (the expected zone). The movements of the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Annals of Statistics

سال: 1996

ISSN: 0090-5364

DOI: 10.1214/aos/1069362308